By using SIAM Journals Online you agree to abide by the
Terms and Conditions of Use.

©  SIAM

 

SIAM Journal on Computing

Table of Contents
Volume 27, Issue 2, pp. 319-604

Please Note: Electronic articles are available well in advance of the printed articles.

What Article options are available ?   View Cart   

Atomic Snapshots in O (n log n) Operations

Hagit Attiya and Ophir Rachman

pp. 319-340

Circuit Bottom Fan-in and Computational Power

Liming Cai, Jianer Chen, and Johan Håstad

pp. 341-355

On The Complexity of Computing Mixed Volumes

Martin Dyer, Peter Gritzmann, and Alexander Hufnagel

pp. 356-400

Interpolating Arithmetic Read-Once Formulas in Parallel

Nader H. Bshouty and Richard Cleve

pp. 401-413

An On-Line Algorithm for Some Uniform Processor Scheduling

Rongheng Li and Lijie Shi

pp. 414-422

The Load, Capacity, and Availability of Quorum Systems

Moni Naor and Avishai Wool

pp. 423-447

Space-Efficient Deterministic Simulation of Probabilistic Automata

Ioan I. Macarie

pp. 448-465

Efficient Matrix Chain Ordering in Polylog Time

Phillip G. Bradford, Gregory J. E. Rawlins, and Gregory E. Shannon

pp. 466-490

Computing Many Faces in Arrangements of Lines and Segments

Pankaj K. Agarwal, Jirí Matousek, and Otfried Schwarzkopf

pp. 491-505

Fault-tolerant Computation in the Full Information Model

Oded Goldreich, Shafi Goldwasser, and Nathan Linial

pp. 506-544

A Spectral Approach to Lower Bounds with Applications to Geometric Searching

Bernard Chazelle

pp. 545-556

Incremental String Comparison

Gad M. Landau, Eugene W. Myers, and Jeanette P. Schmidt

pp. 557-582

Localizing a Robot with Minimum Travel

Gregory Dudek, Kathleen Romanik, and Sue Whitesides

pp. 583-604